|
In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is named after German mathematician Herbert Grötzsch. The Grötzsch graph is a member of an infinite sequence of triangle-free graphs, each the Mycielskian of the previous graph in the sequence, starting from the null graph; this sequence of graphs was used by to show that there exist triangle-free graphs with arbitrarily large chromatic number. Therefore, the Grötzsch graph is sometimes also called the Mycielski graph or the Mycielski–Grötzsch graph. Unlike later graphs in this sequence, the Grötzsch graph is the smallest triangle-free graph with its chromatic number . ==Properties== The Grötzsch graph has chromatic index 5, radius 2, girth 4 and diameter 2. It is also a 3-vertex-connected and 3-edge-connected graph. The independence number is 5, and the domination number is 3. The full automorphism group of the Grötzsch graph is isomorphic to the dihedral group D5 of order 10, the group of symmetries of a regular pentagon, including both rotations and reflections. The characteristic polynomial of the Grötzsch graph is : 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Grötzsch graph」の詳細全文を読む スポンサード リンク
|